On the stability of the hyperbolic cross discrete Fourier transform
نویسندگان
چکیده
A straightforward discretisation of problems in high dimensions often leads to an exponential growth in the number of degrees of freedom. Sparse grid approximations allow for a severe decrease in the number of used Fourier coefficients to represent functions with bounded mixed derivatives and the fast Fourier transform (FFT) has been adapted to this thin discretisation. We show that this so called hyperbolic cross FFT suffers from an increase of its condition number for both increasing refinement and increasing spatial dimension.
منابع مشابه
A general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملReconstructing hyperbolic cross trigonometric polynomials by sampling along generated sets
The evaluation of multivariate trigonometric polynomials at the nodes of a rank-1 lattice leads to a onedimensional discrete Fourier transform. Often, one is also interested in the reconstruction of the Fourier coefficients from their samples. We present necessary and sufficient conditions on rank-1 lattices allowing a stable reconstruction of trigonometric polynomials supported on hyperbolic c...
متن کاملDetection of high impedance faults in distribution networks using Discrete Fourier Transform
In this paper, a new method for extracting dynamic properties for High Impedance Fault (HIF) detection using discrete Fourier transform (DFT) is proposed. Unlike conventional methods that use features extracted from data windows after fault to detect high impedance fault, in the proposed method, using the disturbance detection algorithm in the network, the normalized changes of the selected fea...
متن کاملReconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices
The evaluation of multivariate trigonometric polynomials at the nodes of a rank-1 lattice leads to a onedimensional discrete Fourier transform. Often, one is also interested in the reconstruction of the Fourier coefficients from their samples. We present necessary and sufficient conditions on rank-1 lattices allowing a stable reconstruction of trigonometric polynomials supported on hyperbolic c...
متن کاملNonequispaced Hyperbolic Cross Fast Fourier Transform
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like the fast Fourier transform (FFT) have high computational costs. Hyperbolic cross approximations allow for a severe decrease in the number of used Fourier coefficients to represent functions with bounded mixed derivati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Numerische Mathematik
دوره 117 شماره
صفحات -
تاریخ انتشار 2011